$\mathcal{B}$-partitions, application to determinant and permanent of graphs

Let G be a graph(directed or undirected) having k number of blocks. A B-partition of G is a partition into k vertex-disjoint subgraph (B̂1, B̂1, . . . , B̂k) such that B̂i is induced subgraph of Bi for i = 1, 2, . . . , k. The terms ∏k i=1 det(B̂i), ∏k i=1 per(B̂i) are det-summands and per-summands, respectively, corresponding to the B-partition. The determinant and permanent of a graph having no loops on its cut-vertices is equal to summation of det-summands and per-summands, respectively, corresponding to all possible Bpartitions. Thus, in this paper we calculate determinant and permanent of some graphs, which include block graph with negatives cliques, signed unicyclic graph, mix complete graph, negative mix complete graph, and star mix block graphs.